Multilevel Threshold Secret Image Sharing based on the Chinese Remainder Theorem
نویسندگان
چکیده
(t, n)-threshold secret sharing was first introduced by Shamir and Blakley separately in 1979. Apart from this, there are threshold secret sharing schemes which use the Chinese Remainder Theorem (CRT). The above mentioned are three of the most extensively researched tools used for designing a (t, n)-threshold secret sharing scheme. In this paper we propose a scheme for Multilevel Threshold Secret Image Sharing using the CRT. Multilevel Threshold Secret Sharing (MTSS) is a generalization of the classical secret sharing scheme. In MTSS various participants are classified into levels and the secret is reconstructed from the shares submitted by participants depending on the various levels. Every level has a separate threshold such that a higher level will have a threshold value smaller than that of the threshold of a lower level. Now, participants in each level can reconstruct the secret if the number of shares available is equal to or greater than the threshold of that level. Higher level shares may be used to reconstruct a secret along with lower level shares depending on certain rules. Here, we use Chinese remainder theorem based on Asmuth-Bloom’s scheme to perform MTSS in which the secret is an image. The use of Asmuth-Bloom’s SS makes this scheme unconditionally secure. Our proposed scheme is the first time the CRT is being used for multilevel threshold secret image sharing.
منابع مشابه
Multilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem
A recent work of Harn and Fuyou presents the first multilevel (disjunctive) threshold secret sharing scheme based on the Chinese Remainder Theorem. In this work, we first show that the proposed method is not secure and also fails to work with a certain natural setting of the threshold values on compartments. We then propose a secure scheme that works for all threshold settings. In this scheme, ...
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...
متن کاملGeneral Secret Sharing Based on the Chinese Remainder Theorem
In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed. AMS Subject Classification: 94A62, 11A07
متن کاملRobust Threshold Schemes Based on the Chinese Remainder Theorem
Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the best of our knowledge, these are the first robust threshold cryptosystems based on a CRT-based secret sharing.
متن کاملLossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation
This study proposes a novel multi-image threshold sharing scheme based on Chinese remainder theorem and Lagrange interpolation. The exceptional property of the scheme is its ability to retrieve any secret image without recovering all the other images. Therefore, it works efficiently and reduces computation cost in case it needs to recover only one image from shares. In term of capacity, the sch...
متن کامل